|
| |
|
| |
|
|
Suggestion of data architecture of Intranet and „data mining“ using SQL server
Herman, Jan ; Procházka, Jiří (referee) ; Kříž, Jiří (advisor)
The bachelor thesis proposes data structure of the intranet and the usage of the SQL language in data research. The output of the work is an intranet proposed for a particular organization. Data and functional modeling were used for the suggestion of the data structure and the SQL language served as a basis for creating queries. These queries allow the network user, server administrator and the director of an organization to control the data in a transparent manner. The work is based on the analysis of the current situation and of the information available, though it has been also influenced by modern trends.
|
|
|
Database System Analysis and Implementation
Třetina, Jan ; Ráb, Jaroslav (referee) ; Zendulka, Jaroslav (advisor)
With the increase of demands for the speed and availability of the information technologies, the process of optimization gains more and more importance. Concerning search engine optimization, optimization of operating systems or application optimization (source code), the goal is to gain faster, smaller and more maintainable solution. In my thesis I deal with optimization of database systems, which includes low level of database tuning - physical organization of data and indices, database management system tuning and query optimization. I focused on optimization of Microsoft SQL Servers 2005 in enterprise environment.
|
|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
|
|
Data Structures with Paralell Access
Opletal, Tomáš ; Lengál, Ondřej (referee) ; Holík, Lukáš (advisor)
Parallel programming brings out, apart from the opportunity to spread out a program execution to many simultaneously running processes sharing data, some new problems. It is necessary to synchronize these processes running in parallel and make sure that during the process communication and data sharing there will not arise any troubles. These synchronization algorithms also cannot use too much resources that are otherwise used for the actual program. This thesis describes ways of process synchronization and also provides an implementation of several algorithms for parallel queue. Implemented algorithms were also tested for their performance.
|
|
|
Interactive Data Structures
PRŠALA, Jan
The goal of this thesis is creating simple application for teaching dats structures - mostly focusing on data structures queue, stack, linked list, binary search tree and hash table. Each data structure is contained in its own modul and is shown on an example from the real world and in an abstract example, which can be modified by the user. This thesis itself contains the description of the data structures mentioned above. Instructions on how to add more modules are also there. The application itself with all the source code and the example of implementation of each data structure is located on the enclosed CD.
|
|
| |
|
| |
|
| |
guest ::
